// 查找数组中出现次数多于一半的数
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int n;
vector<int> A;
int candidate(int m)
{
    cerr << "can " << m << endl;
    int j = m;
    int c = A[m];
    int count = 1;
    while(j < n && count > 0)
    {
        ++j;
        if(A[j] == c) ++count;
        else --count;
    }
    if(j == n) return c;
    else return candidate(j+1);
}

int main()
{
    cin >> n;
    A.push_back(0);
    for(int i = 0; i != n; i++)
    {
        int x;
        scanf("%d", &x);
        A.push_back(x);
    }

    int c = candidate(1);
    cerr << "c " << c << endl;
    int count = 0;
    for(int j = 1; j <= n; j++)
    {
        if(A[j] == c) ++count;
    }
    if(count > n/2) cout << c << endl;
    else cout << "none" << endl;
    return 0;
}
/*
每轮从数组中排除若干对不同的数
最后一轮中得到最后一部分数组中出现次数过半的数
检查此数是不是整个数组中出现次数过半的数
*/